Inverted Index Support for Numeric Search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverted Index Support for Numeric Search

Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric data, are becoming common; structured search over XML data will soon follow. This is particularly true in the enterprise search domain, where engines attempt to integrate data from the Web and corporate knowledge portals...

متن کامل

3D Inverted Index with Cache Sharing for Web Search Engines

Web search engines achieve efficient performance by partitioning and replicating the indexing data structure used to support query processing. Current practice simply partitions and replicates the text collection on the set of cluster processors and then constructs in each processor an index data structure. This paper proposes a different approach by constructing an index data structure that pr...

متن کامل

On Inverted Index Compression for Search Engine Efficiency

Efficient access to the inverted index data structure is a key aspect for a search engine to achieve fast response times to users’ queries. While the performance of an information retrieval (IR) system can be enhanced through the compression of its posting lists, there is little recent work in the literature that thoroughly compares and analyses the performance of modern integer compression sch...

متن کامل

Asynchronous Search for Numeric DisCSPs

In Distributed CSPs (DisCSPs), agents may want to keep parts of their problem secret but accept to cooperate by exchanging proposals. Asynchronism in solving DisCSPs [1] increases flexibility, parallelism, and robustness. Enumerative algorithms apply for discrete problems with small domains. Our goal is to develop asynchronous algorithms that can deal with numeric constraints. Centralized techn...

متن کامل

Mining Optimized Support Rules for Numeric Attributes

Mining association rules on large data sets have received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Internet Mathematics

سال: 2006

ISSN: 1542-7951,1944-9488

DOI: 10.1080/15427951.2006.10129119